Deterministic sampling from uniform distributions with Sierpiński space-filling curves

نویسندگان

چکیده

In this paper the problem of sampling from uniform probability distributions is approached by means space-filling curves, a topological concept that has found number important applications in recent years. Departing theoretical fact they are surjective but not necessarily injective, investigation focused upon structure obtained when their domains swept and discrete manner, corresponding values used to build histograms, approximations true PDFs. This work concentrates on real interval [0,1] Sierpiński curve was chosen because its favorable computational properties. order validate results, Kullback–Leibler other divergence measures comparing several levels granularity with already established methods. truth, generation random numbers deterministic simulation randomness using numerical operations. fashion, sequences resulting sort process truly random. Despite this, be coherent literature, expression “random number” will along text mean “pseudo-random number”.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extensible grids: uniform sampling on a space-filling curve

We study the properties of points in [0, 1]d generated by applying Hilbert’s space-filling curve to uniformly distributed points in [0, 1]. For deterministic sampling we obtain a discrepancy of O(n−1/d) for d ≥ 2. For random stratified sampling, and scrambled van der Corput points, we get a mean squared error of O(n−1−2/d) for integration of Lipshitz continuous integrands, when d ≥ 3. These rat...

متن کامل

Unconventional Space-filling Curves

A 2-dimensional space-filling curve, here, is a surjective continuous map from an interval to a 2-dimensional space. To construct a new space-filling curve distinct and much different from Hilbert’s, Peano’s, and the Z-order, we first observe that all three of these curves are based on self-similar fractals–in particular, the recursive definition of the sequences of functions that converge to t...

متن کامل

Clustering Microarray Data with Space Filling Curves

We introduce a new clustering method for DNA microarray data that is based on space filling curves and wavelet denoising. The proposed method is much faster than the established fuzzy c-means clustering because clustering occurs in one dimension and it clusters cells that contain data, instead of data themselves. Moreover, preliminary evaluation results on data sets from Small Round Blue-Cell t...

متن کامل

Image Encryption with Space - filling Curves

Conventional encryption techniques are usually applicable for text data and often unsuited for encrypting multimedia objects for two reasons. Firstly, the huge sizes associated with multimedia objects make conventional encryption computationally costly. Secondly, multimedia objects come with massive redundancies which are useful in avoiding encryption of the objects in their entirety. Hence a c...

متن کامل

Space filling curves in steganalysis

We introduce a new method to increase the reliability of current steganalytic techniques by optimising the sample order. Space filling curves (e. g., Hilbert curve) take advantage of the correlation of adjacent pixels and thus make the detection of steganographic messages with low change densities more reliable. The findings are applicable, but not limited to LSB steganalysis. An experimental c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Statistics

سال: 2021

ISSN: ['0943-4062', '1613-9658']

DOI: https://doi.org/10.1007/s00180-021-01128-w